Linear Programming Bounds for Ordered Orthogonal Arrays and (T;M;S)-nets
نویسنده
چکیده
A recent theorem of Schmid and Lawrence establishes an equivalence between (T; M; S)-nets and ordered orthogonal arrays. This leads naturally to a search both for constructions and for bounds on the size of an ordered orthogonal array. Subsequently, Martin and Stinson used the theory of association schemes to derive such a bound via linear programming. In practice, this involves large-scale computation and issues of numerical accuracy immediately arise. We propose a hybrid technique which gives lower bounds | obtained in exact arithmetic | on the number of rows in an ordered orthogonal array. The main result of the paper is a table showing the implications of these bounds for the study of (T; M; S)-nets.
منابع مشابه
Association Schemes for Ordered Orthogonal Arrays and (t,m,s)-nets
In an earlier paper 9], we studied a generalized Rao bound for ordered orthogonal arrays and (T; M; S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We ...
متن کاملA Dual Plotkin Bound for (T, M, S) -Nets
The effectiveness of Quasi-Monte Carlo methods for numerical integration has led to the study of (T,M, S)-nets, which are uniformly distributed point sets in the Euclidean unit cube. A recent result, proved independently by Schmid/Mullen and Lawrence, establishes an equivalence between (T,M, S)-nets and ordered orthogonal arrays. In a paper of Martin and Stinson, a linear programming technique ...
متن کاملLinear programming bounds for (T,M, S)-nets
of volume bT−M contains exactly b points of the net. (Note that V ol(E) = b− ∑ di .) These deterministic low-discrepancy point sets have proven powerful in the estimate of high-dimensional integrals. The goal is to make the quality parameter T as close to zero as possible. Some researchers work on constructions of such nets and ideas from coding theory have led to very powerful examples [7]. Bu...
متن کاملA Generalized Rao Bound for Ordered Orthogonal Arrays and (t; M; S)-nets
In this paper, we provide a generalization of the classical Rao bound for orthogonal arrays, which can be applied to ordered orthogonal arrays and (t; m; s)-nets. Application of our new bound leads to improvements in many parameter situations to the strongest bounds (i.e., necessary conditions) for existence of these objects.
متن کاملGeometrical Constructions for Ordered Orthogonal Arrays and (T, M, S)-Nets
The concept of a linear ordered orthogonal array is introduced, and its equivalent geometrical configuration is determined when its strength is 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.
متن کامل